The Computational Complexity of the Correct-Prefix Property for TAGs
نویسنده
چکیده
A new upper bound is presented for the computational complexity of the parsing problem for TAGs, under the constraint that input is read from left to right in such a way that errors in the input are observed as soon as possible, which is called the "correct-prefix property." The former upper bound, O(n9), is now improved to O(n6), which is the same as that of practical parsing algorithms for TAGs without the additional constraint of the correct-prefix property.
منابع مشابه
Solving the correct-pre x property for TAGs
We present a new upper bound for the computational complexity of the parsing problem for TAGs, under the constraint that input is read from left to right in a way that errors in the input are observed as soon as possible, which is called the correct-preex property. The former upper bound was O(n 9), which we now improve to O(n 6), which is the same as that of practical parsing algorithms for TA...
متن کاملLeft-To-Right Parsing and Bilexical Context-Free Grammars
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalism that is an abstraction of language models used in several state-of-the-art real-world parsers. We provide evidence that left-to-right parsing cannot be realised within acceptable time-bounds if the so called correct-prefix property is to be ens...
متن کاملExistential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification
Descriptive complexity theory aims at inferring a problem’s computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin’s Theorem, by which a property is expressible in existential second-order logic (eso logic) if, and only if, it is in NP. A natural question, from the theory’s point of view, is which syntactic fragments of eso logic also st...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computational Linguistics
دوره 25 شماره
صفحات -
تاریخ انتشار 1999